CSP-CASL-Prover: A Generic Tool for Process and Data Refinement
نویسندگان
چکیده
The specification language Csp-Casl allows one to model processes as well as data of distributed systems within one framework. In our paper, we describe how a combination of the existing tools Hets and CspProver can solve the challenges that Csp-Casl raises on integrated theorem proving for processes and data. For building this new tool, the automated generation of theorems and their proofs in Isabelle/HOL plays a fundamental role. A case study of industrial strength demonstrates that our approach scales up to complex problems.
منابع مشابه
CSP-CASL - A new integration of process algebra and algebraic specification
CSP–CASL integrates the process algebra CSP [T. Hoare, Communicating Sequential Processes, Prentice-Hall, Englewood cliffs, NJ, 1985; A.W. Roscoe, The Theory and Practice of Concurrency, Prentice-Hall, Englewood cliffs, NJ, 1998] with the algebraic specification language CASL [P.D. Mosses (Ed.), CASL Reference Manual, Lecture Notes in Computer Science, Vol. 2960, Springer, Berlin, 2004; E. Aste...
متن کاملCSP-CASL-Prover — Tool integration and algorithms for automated proof generation
The specification language Csp-Casl allows one to model data as well as processes of distributed systems within one framework. In our paper, we describe how a combination of the existing tools HETS and Csp-Prover can solve the challenges that Csp-Casl raises on integrated theorem proving for processes and data. For building this new tool, the automated generation of theorems and their proofs in...
متن کاملCompositional Modelling and Reasoning in an Institution for Processes and Data
The language Csp-Casl combines specifications of data and processes. We give an institution based semantics to Csp-Casl that allows us to re-use the institution independent structuring mechanisms of Casl. Furthermore, we extend Csp-Casl with a notion of refinement that reconciles the differing philosophies behind the refinement notions for Csp and Casl. We develop a compositional proof calculus...
متن کاملA Generic Theorem Prover of CSP Refinement
We describe a new tool called Csp-Prover which is an interactive theorem prover dedicated to refinement proofs within the process algebra Csp. It aims specifically at proofs for infinite state systems, which may also involve infinite non-determinism. Semantically, Csp-Prover supports both the theory of complete metric spaces as well as the theory of complete partial orders. Both these theories ...
متن کاملStructured Specification with Processes and Data — Theory, Tools and Applications
The integration of processes and data is a long standing research topic. In this thesis, we study this integration in the context of the language CSP-CASL, where CSP is used to describe processes aspects and CASL is used to describe data aspects. Our specific questions are: Is it possible to make structuring operations available for building up complex specifications in a compositional way? Wha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 250 شماره
صفحات -
تاریخ انتشار 2009